New Symmetric Designs from Regular Hadamard Matrices
نویسنده
چکیده
For every positive integer m, we construct a symmetric (v, k, λ)-design with parameters v = h((2h−1) 2m−1) h−1 , k = h(2h − 1)2m−1, and λ = h(h − 1)(2h − 1)2m−2, where h = ±3 · 2 and |2h − 1| is a prime power. For m ≥ 2 and d ≥ 1, these parameter values were previously undecided. The tools used in the construction are balanced generalized weighing matrices and regular Hadamard matrices of order 9 · 4. Submitted: October 30, 1997; Accepted: November 17, 1997 MR Subject Number: 05B05
منابع مشابه
A family of non class-regular symmetric transversal designs of spread type
Many classes of symmetric transversal designs have been constructed from generalized Hadamard matrices and they are necessarily class regular. In [2] we constructed symmetric transversal designs using spreads of Z 2n p with p a prime. In this article we show that most of them admit no class regular automorphism groups. This implies that they are never obtained from generalized Hadamard matrices...
متن کاملON DESIGNS CONSTRUCTED FROM HADAMARD MATRICES SHOAIB UD DIN and V. C. MAVRON
There is a well-known correspondence between symmetric 2-(4ju— 1,2/z — 1,/z — 1) designs and Hadamard matrices of order 4^. It is not so well known that there is a natural correspondence between Hadamard matrices of order 2\x and affine l-(4ju, 2^, 2(i) designs whose duals are also affine. Such a design is denoted by H^fi) in this paper. Under this natural correspondence, two H^fi) designs are ...
متن کاملA Family of Antipodal Distance-Regular Graphs Related to the Classical Preparata Codes
A new family of distance-regular graphs is constructed. They are antipodal 2 -fold covers of the complete graph on 2 vertices. The automorphism groups are determined, and the extended Preparata codes are reconstructed using walks on these graphs. There are connections to other interesting structures: the graphs are equivalent to certain generalized Hadamard matrices; and their underlying 3-clas...
متن کاملA Family of Antipodal Distance-Regular Graphs Related to the Classical Preparata Codes
A new family of distance-regular graphs is constructed. They are antipodal 22t−1-fold covers of the complete graph on 22t vertices. The automorphism groups are determined, and the extended Preparata codes are reconstructed using walks on these graphs. There are connections to other interesting structures: the graphs are equivalent to certain generalized Hadamard matrices; and their underlying 3...
متن کاملNew quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices
Using Hadamard matrices and mutually orthogonal Latin squares, we construct two new quasi-symmetric designs, with parameters 2 − (66, 30, 29) and 2− (78, 36, 30). These are the first examples of quasisymmetric designs with these parameters. The parameters belong to the families 2− (2u2−u, u2−u, u2−u−1) and 2− (2u2 +u, u2, u2−u) which are related to Hadamard parameters. The designs correspond to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 5 شماره
صفحات -
تاریخ انتشار 1998